An omega-Complete Equational Specification of Interleaving
نویسندگان
چکیده
We consider the process theory PA that includes an operation for parallel composition, based on the interleaving paradigm. We prove that the standard set of axioms of PA is not !-complete by providing a set of axioms that are valid in PA, but not derivable from the standard ones. We prove that extending PA with this set yields an !-complete speci cation, which is nite in a setting with nitely many actions. 2000 Mathematics Subject Classi cation: 68Q10; 68Q65; 68Q7
منابع مشابه
An !-complete Equational Speci cation of Interleaving
We consider the process theory PA that includes an operation for parallel composition, based on the interleaving paradigm. We prove that the standard set of axioms of PA is not !-complete by providing a set of axioms that are valid in PA, but not derivable from the standard ones. We prove that extending PA with this set yields an !-complete speciication, which is nite in a setting with nitely m...
متن کاملAxiomatizing omega and omega-op powers of words
In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.
متن کاملWhich data types have w-complete initial algebra specifications?*
Bergstra, J.A. and J. Heering, Which data types have o-complete initial algebra specifications’?, Theoretical Computer Science 124 (1994) 1499168. An algebraic specification is called w-complete or inductively complete if all (open as well as closed) equations valid in its initial model are equationally derivable from it, i.e., if the equational theory of the initial model is identical to the e...
متن کاملContract-Oriented Specifications
In classes developed using design-by-contract, contracts contain assertions that formalise preconditions, postconditions and invariants. To be sure that contracts are complete, they can be derived from specifications. For classes in a data structures library, equational specifications are appropriate. However, a conventional equational specification cannot usually be mapped directly to contract...
متن کاملFinite Equational Bases for Fragments of CCS with Restriction and Relabelling
We investigate the equational theory of several fragments of CCS modulo (strong) bisimilarity with special attention to restriction and relabelling. The largest fragment we consider includes action prefixing, choice, parallel composition without communication, restriction and relabelling. We present a finite equational base (i.e., a finite groundcomplete and omega-complete axiomatisation) for i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000